The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond

نویسندگان

  • Christian Liebchen
  • Rolf H. Möhring
چکیده

In the planning process of railway companies, we propose to integrate important decisions of network planning, line planning, and vehicle scheduling into the task of periodic timetabling. From such an integration, we expect to achieve an additional potential for optimization. Models for periodic timetabling are commonly based on the Periodic Event Scheduling Problem (PESP). We show that, for our purpose of this integration, the PESP has to be extended by only two features, namely a linear objective function and a symmetry requirement. These extensions of the PESP do not really impose new types of constraints, because practitioners have already required them even when only planning timetables autonomously without interaction with other planning steps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A discrete-event optimization framework for mixed-speed train timetabling problem

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

متن کامل

A state-of-the-art realization of cyclic railway timetable computation

We describe the Periodic Event Scheduling Problem (PESP) based on periodic event networks and extend it by symmetry constraints. The modeling power of the PESP is discussed for automatic calculation of feasible periodic railway timetables. Including the described extensions, complete modeling of integrated regularinterval timetables is possible. Encoding PESP to propositional logic enables the ...

متن کامل

A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables

We consider the problem of satisfying the maximum number of constraints of an instance of the Periodic Event Scheduling Problem (PESP). This is a key issue in periodic railway timetable construction, and has many other applications, e.g. for traffic light scheduling. We generalize two (in-) approximability results, which are known for MAXIMUM-K-COLORABLE-SUBGRAPH. Moreover, we present a determi...

متن کامل

Symmetry for Periodic Railway Timetables

Periodic timetabling for railway networks is usually modeled by the Periodic Event Scheduling Problem (PESP). This model permits to express many requirements that practitioners impose on periodic railway timetables. We discuss a requirement practitioners are asking for, but which, so far, has not been the topic of mathematical studies: the concept of symmetry. Several motivations why symmetric ...

متن کامل

Train Scheduling Problem - Phase I: A General Simulation Modeling Framework

One of the important problems in management of railway systems is train scheduling problem. This is the problem of determining a timetable for a set of trains that do not violate infrastructure capacities and satisfies some operational constraints. In this study, a feasible timetable generator framework for stochastic simulation modeling is developed. The objective is to obtain a feasible tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004